|
Automata theory is the study of ''abstract machines'' and ''automata'', as well as the computational problems that can be solved using them. It is a theory in theoretical computer science, under discrete mathematics (a section of Mathematics and also of Computer Science). ''Automata'' comes from the Greek word αὐτόματα meaning "self-acting". The figure at right illustrates a finite state machine, which belongs to one well-known variety of automaton. This automaton consists of states (represented in the figure by circles), and transitions (represented by arrows). As the automaton sees a symbol of input, it makes a ''transition'' (or ''jump'') to another state, according to its ''transition function'' (which takes the current state and the recent symbol as its inputs). Automata theory is also closely related to formal language theory. An automaton is a finite representation of a formal language that may be an infinite set. Automata are often classified by the class of formal languages they are able to recognize. Automata play a major role in theory of computation, compiler design, artificial intelligence, parsing and formal verification. ==Automata== Following is an introductory definition of one type of automaton, which attempts to help one grasp the essential concepts involved in automata theory(s). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Automata theory」の詳細全文を読む スポンサード リンク
|